
Entropic Quadtrees and Mining Mars Craters.

Information%2DTheoretical Mining of Determining Sets for Partially Defined Functions.

Binary Sequences and Association Graphs for Fast Detection of Sequential Patterns.
Abstract. We develop an efficient algorithm for detecting frequent patterns that occur in sequence databases under certain constraints. By combining the use of bit vector representations of sequence databases with association graphs we achieve superior time and low memory usage based on a considerable reduction of the number of candidate patterns. 1
Mining Determining Sets for Partially Defined Functions.
Abstract. This paper describes an algorithm that determines the minimal sets of variables that determine the values of a discrete partial function. The Apriori-like algorithm is based on the dual hereditary property of determining sets. Experimental results are provided that demonstrate the efficiency of the algorithm for functions with up to 24 variables. The dependency of the number of minimal determining sets on the size of the specification of the partial function is also examined. 1
Mining Approximative Descriptions of Sets Using Rough Sets.
Using concepts from rough set theory we investigate the existence of approximative descriptions of collections of objects that can be extracted from in data set, a problem of interest for biologists that need to find succinct descriptions of families of taxonomic units. Our algorithm is based on an anti-monotonicity of borders of object set and makes use of an approach that is, in a certain sense, a dual of the Apriori algorithm used in identifying frequent item sets. 1
Scalable pattern mining with Bayesian networks as background knowledge.

Approximate Computation of Object Distances by Locality%2DSensitive Hashing.
Data Mining is the process of extracting useful and nontrivial information from databases. Databases tend to be very big. As a consequence, fast and scalable data mining techniques are increasingly becoming more important. This dissertation introduces four new data mining techniques which use binary representation of data, and take advantage of bit vectors to allow for fast computation and low memory requirements. Finding frequent item sets is a very important problem that can be solved in exponential time. In general, the algorithms that find all the frequent item sets are not practical. Chapter 2 introduces a fast and approximative algorithm for finding the frequent item sets in quadratic time. In the same chapter, it is shown the algorithm works very well in practice. Chapter 3 introduces a new clustering algorithm that is designed for text documents. In a text document database, we use a dictionary for finding synonyms and therefore considerably reduce the size of unique words. The main algorithm creates iv overlapping clusters with cluster descriptions. An extensive set of experiments on
Structure Inference of Bayesian Networks from Data A New Approach Based on Generalized Conditional Entropy.

Betweenness%2C Metrics and Entropies in Lattices.

Structural Classification of XML Documents Using Multisets.

On Clustering Users%27 Behaviors in Video Sessions.

Clustering and Approximate Identification of Frequent Item Sets.

Multisets and Clustering XML Documents.

Multisets and Clustering XML Documents.

RPyR Nouvelle Structure dpos%3BIndxation avec Cassfication par Projections Al%26eacute%3Batoires.

On the Axiomatization of Generalized Entropic Metrics.

Clustering by Random Projections.
Abstract. Ensemble techniques have been successfully applied in the context of supervised learning to increase the accuracy and stability of classification. Recently, analogous techniques for cluster analysis have been suggested. Research has demonstrated that, by combining a collection of dissimilar clusterings, an improved solution can be obtained. In this paper, we examine the potential of applying ensemble clustering techniques with a focus on the area of medical diagnostics. We present several ensemble generation and integration strategies, and evaluate each approach on a number of synthetic and real-world datasets. In addition, we show that diversity among ensemble members is necessary, but not sufficient to yield an improved solution without the selection of an appropriate integration method. 1
Metric%2DEntropy Pairs on Lattices.
Abstract: We introduce the notion of ∧- and∨-pairs of functions on lattices as an abstraction of the notions of metric and its related entropy for probability distributions. This approach allows us to highlight the relationships that exist between various properties of metrics and entropies and opens the possibility of extending these concepts to other algebraic structures.
Detecting eye fixations by projection clustering.
Eye movements are certainly the most natural and repetitive movement of a human being. The most mundane activity, such as watching television or reading a newspaper, involves this automatic activity which consists of shifting our gaze from one point to another. Identification of the components of eye movements (fixations and saccades) is an essential part in the analysis of visual behavior because these types of movements provide the basic elements used by further investigations of human vision. However, many of the algorithms that detect fixations present a number of problems. In this article, we present a new fixation identification technique that is based on clustering of eye positions, using projections and projection aggregation applied to static pictures. We also present a new method that computes dispersion of eye fixations in videos considering a multiuser environment. To demonstrate the performance and usefulness of our approach we discuss our experimental work with two different applications: on fixed image and video.
Eye%2Fgaze tracking in web%2C image and video documents.

Biclustering of Gene Expression Data Based on Local Nearness.

On the Ranges of Algebraic Functions in Lattices %2D A Preliminary Report.

Generalized Conditional Entropy and a Metric Splitting Criterion for Decision Trees.

A new metric splitting criterion for decision trees.

On the Ranges of Algebraic Functions on Lattices.

On the Ranges of Algebraic Functions on Lattices.

Semi%2Dsupervised incremental clustering of categorical data.

On Feature Selection through Clustering.
We study an algorithm for feature selection that clusters attributes using a special metric and then makes use of the dendrogram of the resulting cluster hierarchy to choose the most relevant attributes. The main interest of our technique resides in the improved understanding of the structure of the analyzed data and of the relative importance of the attributes for the selection process. 1
An Abstract Axiomatization of the Notion of Entropy.
We present an abstract axiomatization of generalized entropy using the notion of ordinal number and the new concept of systemic set of equivalence relations. The aximoatization applies to arbitrary sets and extends previous results obtained for the finite case. 1
An Abstract Axiomatization of the Notion of Entropy.
We present an abstract axiomatization of generalized entropy using the notion of ordinal number and the new concept of systemic set of equivalence relations. The aximoatization applies to arbitrary sets and extends previous results obtained for the finite case. 1
A metric approach to supervised discretization.

A metric approach to supervised discretization.

Metric Incremental Clustering of Nominal Data.
We present an algorithm for clustering nominal data that is based on a metric on the set of partitions of a finite set of objects; this metric is defined starting from a lower valuation of the lattice of partitions. The proposed algorithm seeks to determine a clustering partition such that the total distance between this partition and the partitions determined by the attributes of the objects has a local minimum. The resulting clustering is quite stable relative to the ordering of the objects.
Evolutionary Strategy for Learning Multiple%2DValued Logic Functions.

A Graph%2DTheoretical Approach to Boolean Interpolation of Non%2DBoolean Functions.

Interestingness of frequent itemsets using Bayesian networks as background knowledge.

A Metric Approach to Building Decision Trees Based on Goodman%2DKruskal Association Index.

Measures on Boolean polynomials and their applications in data mining.
 
A greedy algorithm for supervised discretization.
We present a greedy algorithm for supervised discretization using a metric defined on the space of partitions of a set of objects. This proposed technique is useful for preparing the data for classifiers that require nominal attributes. Experimental work on decision trees and naive Bayes classifiers confirm the efficacy of the proposed algorithm.
Review of %22The classical decision problem%22 by Egon B%26ouml%3Brger
An important limitation of traditional logic programming as a knowledge representation tool, in comparison with classical logic, is that logic programming does not allow us to deal directly with incomplete information. In order to overcome this limitation, we extend the class of general logic programs by including classical negation, in addition to negation-as-failure. The semantics of such extended programs is based on the method of stable models. The concept of a disjunctive database can be extended in a similar way. We show that some facts of commonsense knowledge can be represented by logic programs and disjunctive databases more easily when classical negation is available. Computationally, classical negation can be eliminated from extended programs by a simple preprocessor. Extended programs are identical to a special case of default theories in the sense of Reiter. 1 Introduction  An important limitation of traditional logic programming as a knowledge representation tool, in comp...
Generalized Conditional Entropy and Decision Trees.

Generalized Conditional Entropy and Decision Trees.



Mining Purity Dependencies in Databases.
. We introduce purity dependencies as generalizations of functional dependencies in relational databases starting from the notion of impurity measure. The impurity measure of a subset of a set relative to a partition of that set and the relative impurity of two partitions allow us to dene the relative impurity of two attribute sets of a table of a relational database and to introduce purity dependencies. We discuss properties of these dependencies that generalize similar properties of functional dependencies and we highlight their relevance for approximate classications. Finally, an algorithm that mines datasets for these dependencies is presented. 1 
Generating an informative cover for association rules.
Mining association rules may generate a large numbers of rules making the results hard to analyze manually. Pasquier et al. have discussed the generation of GuiguesDuquenne --Luxenburger basis (GD-L basis). Using a similar approach, we introduce a new rule of inference and define the notion of association rules cover as a minimal set of rules that are non-redundant with respect to this new rule of inference. Our experimental results (obtained using both synthetic and real data sets) show that our covers are smaller than the GD-L basis and they are computed in time that is comparable to the classic Apriori algorithm for generating rules.
On Functions Defined on Free Boolean Algebras.
Abstract. We study the class of depth zero Boolean algebras, both from a classical viewpoint and an effective viewpoint. In particular, we provide an algebraic characterization, constructing an explicit measure for each depth zero Boolean algebra and demonstrating there are no others, and an effective characterization, providing a necessary and sufficient condition for a depth zero Boolean algebra of rank at most ω to have a computable presentation. 1.
Pruning Redundant Association Rules Using Maximum Entropy Principle.
Data mining algorithms produce huge sets of rules, practically impossible to analyze manually. It is thus important to develop methods for removing redundant rules from those sets. We present a solution to the problem using the Maximum Entropy approach. The problem of eciency of Maximum Entropy computations is addressed by using closed form solutions for the most frequent cases. Analytical and experimental evaluation of the proposed technique indicates that it eciently produces small sets of interesting association rules.
Support Approximations Using Bonferroni%2DType Inequalities.
The purpose of this paper is to examine the usability of Bonferroni-type combinatorial inequalities to estimation of support of itemsets as well as general Boolean expressions. Families of inequalities for various types of Boolean expressions are presented and evaluated experimentally.
Impurity measures in databases.
We introduce purity dependencies as generalizations of functional dependencies  in relational databases starting from the notion of impurity  measure. The impurity measure of a subset of a set relative to a partition  of that set and the relative impurity of two partitions allow us to de  ne  the relative impurity of two attribute sets of a table of a relational database  and to introduce purity dependencies. We discuss properties of these  dependencies that generalize similar properties of functional dependencies  and we highlight their relevance for approximate classi  cations. Finally,  an algorithm that mines datasets for these dependencies is presented.
An axiomatization of partition entropy.

Finding Median Partitions Using Information%2DTheoretical%2DBased Genetic Algorithms.
Abstract: In a database with categorical attributes, each attribute defines a partition whose classes can be regarded as natural clusters of rows. In this paper we focus on finding a partition of the rows of a given database, that is as close as possible to the partitions associated to each attribute. We evaluate the closeness of two partitions by using a generalization of the classical conditional entropy. From this perspective, we wish to construct a partition (referred to as the median partition) such that the sum of the dissimilarities between this partition and all the partitions determined by the attributes of the database is minimal. Then, the problem of finding the median partition is an optimization problem, over the space of all partitions of the rows of the database, for which we give an approximative solution. To search more efficiently the large space of possible partitions we use a genetic algorithm where the partitions are represented by chromosomes. Our genetic algorithm obtains better clustering results than the classical k-means algorithm.
An Axiomatization of Generalized Entropy of Partitions.
 
A General Measure of Rule Interestingness.
The paper presents a new general measure of rule interestingness. Many known measures such as chi&amp;sup2; , gini gain or entropy gain can be obtained from this measure by setting some numerical parameters representing the amount of trust we have in the estimates of certain probabilities from the data. Moreover we show that there is a continuum of measures having chi&amp;sup2; , Gini gain and entropy gain as boundary cases. Properties and experimental evaluation of the new measure are also presented.
Data Mining of Weak Functional Decompositions.

Generalized Entropy and Projection Clustering of Categorical Data.
. We generalize the notion of entropy for a set of attributes of a table and we study its applications to clustering of categorical data. This new concept allows greater exibility in identifying sets of attributes and, in a certain case, is naturally related to the average distance between the records that are the object of clustering. An algorithm that identi- es clusterable sets of attributes (using several types of entropy) is also presented as well as experimental results obtained with this algorithm. 1 
Galois Connections and Data Mining.
: We investigate the application of Galois connections to the identication of frequent item sets, a central problem in data mining. Starting from the notion of closure generated by a Galois connection, we dene the notion of extended closure, and we use these notions to improve the classical Apriori algorithm. Our experimental study shows that in certain situations, the algorithms that we describe outperform the  Apriori algorithm. Also, these algorithms scale up linearly.  Key Words: Galois connection, closure, extended closure, support, frequent set of items  Category: H.2.0, E.5 1 
Learning with Permutably Homogeneous Multiple%2DValued Multiple%2DThreshold Perceptrons.

On Axiomatization of Conditional Entropy of Functions Between Finite Sets.

Automatic Data Restructuring.

Learning with Permutably Homogenous Multiple%2DValued Multiple%2DThreshold Perceptrons.

Functional Entropy and Decision Trees.

Completeness Criteria in Set%2DValued Logic Under Compositions with Union and Intersection.

A Characterization of Boolean Collections of Set%2DValued Functions.


Several Remarks on the Complexity of Set%2DValued Switching Functions.


Enumeration of Function and Bases of Three%2DValued Set Logic under compositions with Boolean Functions.

Several Remarks on Algebraic Entropy.

A Categorical Approach to Database Semantics.

On Functional Entropy.
Systems for inducing concept descriptions from examples are valuable tools for  assisting in the task of knowledge acquisition for expert systems. This paper presents  a description and empirical evaluation of a new induction system, cn2, designed for  the efficient induction of simple, comprehensible production rules in domains where  problems of poor description language and/or noise may be present. Implementations  of the cn2, id3 and aq algorithms are compared on three medical classification tasks.   
Functional Completeness and Weak Completeness in Set Logic.

Content%2DRelated Interval Queries on Object Histories

An algebraic approach to databases with complex objects.

On Set%2DValued Functions and Boolean Collections.

An algebraic approach to databases with complex objects.

Intersections of Isotone Clones on a Finite Set.

Bio%2DAlgebras.

An algebraic point of view of the data structures of database systems.

Formal semantics for database schemas.

Towards an abstract theory of dependency constraints in relational databases.

Iteration Properties of Multivalued Switching Functions.

Graph Functions of Boolean Functions.

Several remarks on computations of labelled Markov algorithms.

Computing of Graphs of Relations Using Generative Grammars.

Even Initial Feedback Vertex Set Problem is NP%2DComplete.

Computing grammars and contex%2Dsensitive languages.

On Cardinal Sequential Outer Measures.

On Some Measures on Free Semigroups Induced by Semiautomata.

A New Approach of Some Problems Concerning Polynomials Over Finite Fields

